hashSet
Section: OATH Reference Manual (3O)
Updated: 26 August 1991
Index
Return to Main Contents
NAME
hashSet (hashSetA, hashSetG) - a hash table based implementation of set
SYNOPSIS
#include <oath/hashSet.h>
DESCRIPTION
The hashSet is an implementation of set that can hold any obj. It uses the
is() method of objs and hashes on their location in memory. This
implementation is technically compiler-dependent. However, it should work
on all common systems.
DERIVATION
hashSet : set : bag : obj
hashSet is an implementation type.
STATIC OPERATIONS
- hashSetA hashSetA:: isa (objA)
-
hashSetA::isa(O) returns O if it is truly a hashSet; otherwise it
returns Nil.
- hashSetA hashSetA:: make (int = 255)
-
hashSetA::make(B) makes and returns an empty hashSet. B is the number of
buckets to use in the hash table. It should typically be at least half
the number of objs expected to be inserted.
MEMBER OPERATIONS
INTERNAL OPERATIONS
- unsigned int hashSetG:: hash (const objG*)
-
Computes the hash value of an obj. This is the compiler-dependent function.
The number will be between 0 and Buckets-1, inclusive.
SEE ALSO
OATH(3O), set(3O)
AUTHOR
Brian M. Kennedy (Computer Science Center, Texas Instruments Incorporated)
BUGS
Index
- NAME
-
- SYNOPSIS
-
- DESCRIPTION
-
- DERIVATION
-
- STATIC OPERATIONS
-
- MEMBER OPERATIONS
-
- INTERNAL OPERATIONS
-
- SEE ALSO
-
- AUTHOR
-
- BUGS
-
This document was created by
man2html,
using the manual pages.
Time: 00:37:22 GMT, March 30, 2022